A Practical Algorithm for Parsing Non Deterministic Atn-based Natural Language
نویسندگان
چکیده
This work considers a parsing algorithm for implementing ATN-based natural language interfaces. That algorithm has many practical improvements compared to other parsing algorithms. Resolution of syntax ambiguity , programming facilities and post execution of semantic actions are some of the features included too. The algorithm was implemented in order to design a software tool to automatically allow medium size natural language interfaces. In addition, some designed algorithms , the system using these algorithms and their results are described.
منابع مشابه
An E cient Context-Free Backbone for Natural Language Analyzers
Parsing eeciency is crucial when building practical natural language systems. This paper introduces an eecient context-free parsing algorithm based on dynamic programming techniques 1 , and focuses on its practical application to natural languages interfaces. Our analyzer takes a general class of context-free grammars as drivers, using the same user interface applied by the standard generators ...
متن کاملWEDNESDAY: Parsing Flexible Word Order Languages
A parser for "flexible" word order languages must be substantially data driven. In our view syntax has two distinct roles in this connection: (i) to give impulses for assembling cognitive representations, (ii) to structure the space of search for fillers. WEDNESDAY is an interpreter for a language describing the lexicon and operating on natural language sentences. The system operates from left ...
متن کاملParsing Non-Recursive Context-Free Grammars
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of non-recursive context-free grammars, and show th...
متن کاملAn improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کاملAlgorithms for Deterministic Incremental Dependency Parsing
Parsing algorithms that process the input from left to right and construct a single derivation have often been considered inadequate for natural language parsing because of the massive ambiguity typically found in natural language grammars. Nevertheless, it has been shown that such algorithms, combined with treebank-induced classifiers, can be used to build highly accurate disambiguating parser...
متن کامل